On a generalized combinatorial conjecture involving addition mod 2 k − 1 Gérard
نویسندگان
چکیده
In this note, we give a simple proof of the combinatorial conjecture proposed by Tang, Carlet and Tang, based on which they constructed two classes of Boolean functions with many good cryptographic properties. We also give more general properties about the generalization of the conjecture they propose.
منابع مشابه
On Various Combinatorial Sums and Related Identities
In this talk we give a survey of results and methods on some combinatorial sums involving binomial coefficients and related to Bernoulli and Euler polynomials. We will also talk about certain sums of minima and maxima related to Dedekind sums. Some interesting identities associated with the various sums will also be introduced. 1. A curious identity and the sum ∑ k≡r (mod m) ( n k ) In 1988 Zhi...
متن کاملPreprint, arXiv:1010.2489 PROOF OF THREE CONJECTURES ON CONGRUENCES
In this paper we prove three conjectures on congruences involving central binomial coefficients or Lucas sequences. Let p be an odd prime and let a be a positive integer. We show that if p ≡ 1 (mod 4) or a > 1 then ⌊ 3 4 p a ⌋ k=0 −1/2 k ≡ 2 p a (mod p 2),. where (−) denotes the Jacobi symbol. This confirms a conjecture of the second author. We also confirm a conjecture of R. Tauraso by showing...
متن کاملGeneralizations of a Classical Theorem in Number Theory
A classical theorem conjectured by Jacobi asserts that for an odd prime p, the sum of the quadratic residues in the interval (0, p) is less than the sum of the quadratic nonresidues if and only if p ■ 3 (mod 4). We generalize Jacobi's problem to fcth powers (mod p), k > 2, and we consider in some detail a generalization of Jacobi's conjecture to quadratic residues and nonresidues (mod n), n an ...
متن کاملA ug 2 00 5 Preprint ( August 4 , 2005 ) A COMBINATORIAL CONGRUENCE ON POLYNOMIALS
Let p be any prime, and let α and n be nonnegative integers. Let r ∈ Z and f (x) ∈ Z[x]. We establish the congruence p deg f k≡r (mod p α) n k (−1) k f k − r p α ≡ 0 mod p ∞ i=α ⌊n/p i ⌋. This result is a vast generalization of a conjecture arising from algebraic topology. An application to Bernoulli polynomials is also given.
متن کاملSome Congruences Involving Binomial Coefficients
Binomial coefficients and central trinomial coefficients play important roles in combinatorics. Let p > 3 be a prime. We show that Tp−1 ≡ (p 3 ) 3p−1 (mod p), where the central trinomial coefficient Tn is the constant term in the expansion of (1 + x + x−1)n. We also prove three congruences modulo p conjectured by Sun, one of which is p−1 ∑ k=0 ( p− 1 k )( 2k k ) ((−1) − (−3)−k) ≡ (p 3 ) (3p−1 −...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012